Aide à la Décision UMR 7243 Décembre 2012 Moderate exponential time approximation and branching algorithms
نویسندگان
چکیده
We study links between approximation, exponential time computation and fixed parameter tractability. In particular, rather than focusing on one particular optimization problem, we tackle the question of finding sufficient conditions for a problem to admit “good” approximation algorithms in exponential time. In particular, we focus on the existence of “approximation schemata” (ratios 1 ± ǫ for arbitrarily small ǫ) and we exhibit conditions under which a technique of devising approximate branching algorithms reaches interesting results.
منابع مشابه
Laboratoire d ’ Analyses et Modélisation de Systèmes pour l ’ Aide à la Décision UMR 7243 Décembre 2012 A note on Using T - joins to Approximate Solutions for CAHIER DU 32 9
We consider a generalized Path Traveling Salesman Problem where the distances are defined by a 2-edge-connected graph metric and a constant number of salesmen have to cover all the destinations by traveling along paths of minimum total length. We show that for this problem there is a polynomial algorithm with asymptotic approximation ratio of 2 .
متن کاملLaboratoire d ’ Analyses et Modélisation de Systèmes pour l ’ Aide à la Décision UMR 7243 Juin 2012 Exact and approximation algorithms for DENSEST k - SUBGRAPH
The densest k-subgraph problem is a generalization of the maximum clique problem, in which we are given a graph G and a positive integer k, and we search among the subsets of k vertices of G one inducing a maximum number of edges. In this paper, we present algorithms for finding exact solutions of densest k-subgraph improving the standard exponential time complexity of O * (2 n) and using polyn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012